Approximation algorithms for multi-index transportation problems with decomposable costs
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs
The axial multi-index transportation problem is defined as follows. Given are k sets A,, each set having n, elements, r = 1,. , k. The Cartesian product of the sets A, is denoted by A. To each element a E A a certain cost, c, E R, is associated. Further, a nonnegative demand e,; is associated to each set Ari = {u E A : u(r) = i}. The problem is to find nonnegative real numbers x0 such that each...
متن کاملApproximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs
The k-dimensional assignment problem with decomposable costs is formulated as follows. Given is a complete k-partite graph G = (X0 u ... u X,_ I, E), with lXil = p for each i, and a nonnegative length function defined on the edges of G. A clique of G is a subset of vertices meeting each Xi in exactly one vertex. The cost of a clique is a function of the lengths of the edges induced by the cliqu...
متن کاملApproximation Algorithms for Inventory Problems with Submodular or Routing Costs
We consider the following two deterministic inventory optimization problems over a finite planning horizon T with non-stationary demands. • Submodular Joint Replenishment Problem. This involves multiple item types and a single retailer who faces demands. In each time step, any subset of item-types can be ordered incurring a joint ordering cost which is submodular. Moreover, items can be held in...
متن کاملtight frame approximation for multi-frames and super-frames
در این پایان نامه یک مولد برای چند قاب یا ابر قاب تولید شده تحت عمل نمایش یکانی تصویر برای گروه های شمارش پذیر گسسته بررسی خواهد شد. مثال هایی از این قاب ها چند قاب های گابور، ابرقاب های گابور و قاب هایی برای زیرفضاهای انتقال پایاست. نشان می دهیم که مولد چند قاب تنک نرمال شده (ابرقاب) یکتا وجود دارد به طوری که مینیمم فاصله را از ان دارد. همچنین مسایل مشابه برای قاب های دوگان مطرح شده و برخی ...
15 صفحه اولApproximation Algorithms for Bayesian Multi-Armed Bandit Problems
In this paper, we consider several finite-horizon Bayesian multi-armed bandit problems with side constraints. These constraints include metric switching costs between arms, delayed feedback about observations, concave reward functions over plays, and explore-then-exploit models. These problems do not have any known optimal (or near optimal) algorithms in sub-exponential running time; several of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00128-x